Sectionally Pseudocomplemented Posets
نویسندگان
چکیده
Abstract The concept of a sectionally pseudocomplemented lattice was introduced in Birkhoff (1979) as an extension relative pseudocomplementation for not necessarily distributive lattices. typical example such is the non-modular N 5 . aim this paper to extend sectional from lattices posets. At first we show that class forms variety which can be described by two simple identities. This has nice congruence properties. We summarize properties posets and differences pseudocomplementation. prove every poset completely L -semidistributive. introduce on these when quotient structure becomes again. Finally, study Dedekind-MacNeille completion contrary case relatively posets, need but present construction so-called generalized ordinal sum enables us construct provided completions summands are known.
منابع مشابه
Iplications in Sectionally Pseudocomplemented Posets
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which coincides with the relative pseudocomplementation if P is relatively psudocomplemented. We characterise this operation and study some elementary properties of upper...
متن کاملMplications in Sectionally Pseudocomplemented Posets
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which coincides with the relative pseudocomplementation if P is relatively psudocomplemented. We characterise this operation and study some elementary properties of upper...
متن کاملSectionally Pseudocomplemented Residual Lattice
At first, we recall the basic concept, By a residual lattice is meant an algebra ) 1 , 0 , , , , , ( o ∗ ∧ ∨ = L L such that (i) ) 1 , 0 , , , ( ∧ ∨ = L L is a bounded lattice, (ii) ) 1 , , ( ∗ = L L is a commutative monoid, (iii) it satisfies the so-called adjoin ness property: y z y x = ∗ ∨ ) ( if and only if y x z y o ≤ ≤ Let us note [7] that y x ∨ is the greatest element of the set y z y x ...
متن کاملPseudocomplemented directoids
Directoids as a generalization of semilattices were introduced by J. Ježek and R. Quackenbush in 1990. We modify the concept of a pseudocomplement for commutative directoids and study several basic properties: the Glivenko equivalence, the set of the so-called boolean elements and an axiomatization of these algebras.
متن کاملUnification on Subvarieties of Pseudocomplemented Distributive Lattices
Syntactic unification theory is concerned with the problem of finding a substitution that equalises a finite set of pairs of terms simultaneously. More precisely, given a set of function symbols L and a finite set of pairs of L-terms U = {(t1, s1), . . . , (tm, sm)}, called a unification problem, a unifier for U is a substitution σ defined on the set of variables of the terms in U such that σ(t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2021
ISSN: ['1572-9273', '0167-8094']
DOI: https://doi.org/10.1007/s11083-021-09555-6